A Compact Formulation for the $\ell _{2,1}$ Mixed-Norm Minimization Problem
نویسندگان
چکیده
منابع مشابه
A Compact Formulation for the L21 Mixed-norm Minimization Problem
We present an equivalent, compact reformulation of the `2,1 mixednorm minimization problem for joint sparse signal reconstruction from multiple measurement vectors (MMVs). The reformulation builds upon a compact parameterization, which models the rownorms of the sparse signal representation as parameters of interest, resulting in a significant reduction of the MMV problem size. Given the sparse...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملA Mixed Formulation for the Brinkman Problem
The Brinkman model is a unified law governing the flow of a viscous fluid in cavity (Stokes equations) and in porous media (Darcy equations). In this work, we explore a novel mixed formulation of the Brinkman problem. Introducing the flow’s vorticity as additional unknown, this formulation allows for a uniformly stable and conforming discretization by standard finite elements (Nédélec, Raviart-...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2018
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2017.2788431